A Performance and Scalability Metric for Virtual RDF Graphs
نویسندگان
چکیده
From a theoretical point of view, the Semantic Web is understood in terms of a stack with RDF being one of its layers. A Semantic Web application operates on the common data model expressed in RDF. Reality is a bit different, though. As legacy data has to be processed in order to realise the Semantic Web, a number of questions arise when one is after processing RDF graphs on the Semantic Web. This work addresses performance and scalability issues (PSI), viz. proposing a metric for virtual RDF graphs on the Semantic Web—in contrast to a local RDF repository, or distributed, but native RDF stores.
منابع مشابه
EGG: A Framework for Generating Evolving RDF Graphs
We demonstrate EGG (Evolving Graph Generator), an opensource framework for generating evolving RDF graphs based on finelytuned temporal constraints given by the user. During the demonstration, we will showcase the highly-expressive constraints that the user can specify in EGG to generate evolving graphs over various real-world use cases, the accuracy and scalability of the generator, and the ea...
متن کاملSystem Π : A Hypergraph Based Native RDF Repository ∗
To manage the increasing amount of RDF data, an RDF repository should provide not only necessary scalability and efficiency, but also sufficient inference capabilities. In this paper, we propose a native RDF repository, SystemΠ, to pursue a better tradeoff among the above requirements. System Π takes the hypergraph representation for RDF as the data model for its persistent storage, which effec...
متن کاملRoman domination excellent graphs: trees
A Roman dominating function (RDF) on a graph $G = (V, E)$ is a labeling $f : V rightarrow {0, 1, 2}$ suchthat every vertex with label $0$ has a neighbor with label $2$. The weight of $f$ is the value $f(V) = Sigma_{vin V} f(v)$The Roman domination number, $gamma_R(G)$, of $G$ is theminimum weight of an RDF on $G$.An RDF of minimum weight is called a $gamma_R$-function.A graph G is said to be $g...
متن کاملOne Size Does not Fit All: When to Use Signature-based Pruning to Improve Template Matching for RDF graphs
Signature-based pruning is broadly accepted as an effective way to improve query performance of graph template matching on general labeled graphs. Most techniques which utilize signature-based pruning claim its benefits on all datasets and queries. However, the effectiveness of signature-based pruning varies greatly among different RDF datasets and highly related to their dataset characteristic...
متن کاملA CHARACTERIZATION FOR METRIC TWO-DIMENSIONAL GRAPHS AND THEIR ENUMERATION
The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$. In this case, $B$ is called a textit{metric basis} for $G$. The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$. Givi...
متن کامل